U . C . Berkeley Handout N 10 CS 294 : Pseudorandomness and Combinatorial Constructions
نویسندگان
چکیده
Today we will study some conditions under which a very powerful pseudorandom generator can be shown to exist, and also some consequences of the existence of such a pseudorandom generator. We will start by assuming the existence of a permutation p : {0, 1}n → {0, 1}n which is computable in poly(n) time and which, for some constant δ > 0, is (2δn, 2−δn)-one way. (This is an extremely strong assumption: we do not even know of any candidates for such permutations.)
منابع مشابه
Pseudorandomness and Combinatorial Constructions
In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very di cult, or unknown. In computer science, probabilistic algorithms are sometimes simpler and more e cient than the best known deterministic algorithms for the same problem....
متن کاملProduct constructions for cyclic block designs II. Steiner 2-designs
In [4] we introduced a product construction for cyclic Steiner quadruple systems. The purpose of this paper is to modify the construction so that it is applicable to cyclic Steiner 2-designs. A cyclic Steiner 2-design is a Steiner system s(t, k, u), 2 d t < k < u, in which t = 2 and which has an automorphism of order u. We denote such a system by CS(2, k, u). Under suitable conditions we show h...
متن کاملNoise Folding based on General Complete Perturbation in Compressed Sensing
This paper first present a new general completely perturbed compressed sensing (CS) model y=(A+E)(x+u)+e,called noise folding based on general completely perturbed CS system, where y ∈ Rm, u ∈ Rm, u 6= 0, e ∈ Rm, A ∈ Rm×n, m ≪ n, E ∈ Rm×n with incorporating general nonzero perturbation E to sensing matrix A and noise u into signal x simultaneously based on the standard CS model y=Ax+e. Our cons...
متن کاملCs 598csc: Combinatorial Optimization
Let f : 2S → R be a submodular set function. We discuss a connection between submodular functions and convexity that was shown by Lovász [3]. Given an arbitrary (not necessarily submodular) set function f : 2S → R, we can view it as assigning values to the integer vectors in the hypercube [0, 1]n where n = |S|. That is, for each U ⊆ S, f(χ(U)) = f(U). We say that a function f̂ : [0, 1]n → R is a...
متن کاملSome localization theorems on hamiltonian circuits
The self-archived postprint version of this journal article is available at Linköping University Institutional Repository (DiVA): http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-143287 N.B.: When citing this work, cite the original publication. Hasratian, A. S, Khachatrian, N. K, (1990), Some localization theorems on hamiltonian circuits, Journal of combinatorial theory. Series B (Print), 49...
متن کامل